On deterministic canonical bottom-up-parsing
نویسندگان
چکیده
منابع مشابه
Deterministic and Bottom-Up Parsing in Prolog
It is well kncwn that top-dcwn backtracking context free parsers are easy towrite in Prolog, and that these parsers can be extended to give them the per of ATN's. This report shows that a number of other familiar parser designs can be very naturally implemented in Prolog. The top-dotJn parsers can easily be constrained to do deterministic parsing of m(k) languages. Bottcm-up backtrack parsers c...
متن کاملEfficient Bottom-Up Parsing
This paper describes a series of experiments aimed at producing a bot tom-up parser that will produce partial parses suitable for use in robust interpretation and still be reasonably efficient. In the course of these experiments, we improved parse times by a factor of 18 over our first a t tempt, ending with a system that was twice as fast as our previous parser, which relied on strong top-down...
متن کاملSymbolic Lookaheads for Bottom-up Parsing
We present algorithms for the construction of LALR(1) parsing tables, and of LR(1) parsing tables of reduced size. We first define specialized characteristic automata whose states are parametric w.r.t. variables symbolically representing lookahead-sets. The propagation flow of lookaheads is kept in the form of a system of recursive equations, which is resolved to obtain the concrete LALR(1) tab...
متن کاملMinimization of Deterministic Bottom-Up Tree Transducers
We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of normalizing transformations which, among others, guarantee that non-trivial output is produced as early as possible. For a deterministic bottom-up transducer where every state produces either none or infinitely many output...
متن کاملEfficient Disjunctive Unification for Bottom-Up Parsing
This paper describes two novel techniques which, when applied together, in practice significantly reduce the time required for unifying disjunctive feature structures. The first is a safe but fast method for discarding irrelevant disjunctions from newlycreated structures. The second reduces the time required to check the consistency of a structure from exponential to polynomial in the number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1979
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(79)90024-x